Approval Voting for Committee Elections : a General Family of Rules
نویسندگان
چکیده
Approval voting is a well-known voting procedure used, among others, for electing committees, where each voter casts a ballot consisting of a set of approved candidates (without any cardinality constraint). Two prominent rules for electing committees using approval voting are the standard rule (also called minisum), which selects the set of candidates (possibly subject to some cardinality constraint) with the highest number of approvals, and the minimax rule, where the set of elected candidates minimizes the maximum, over all voters, of the Hamming distance to the voter’s ballot. As these two rules are in some way too extreme, we generalize them into a continuum of rules, by using ordered weighted averaging operators (OWA). The rule is parameterized by a weight vector W, which allows us to model voting procedures between minisum and minimax. We focus on non-decreasing weight vectors, and in particular, vectors of the form W(i)=(0,..,0,1,..,1), where i is the number of 0’s. We address the computational aspects of finding a winning committee and all the winning committees for rules associated with the W(i) vectors. We show that finding a winning committee for these rules is NP-hard whereas it is computationally easy for minisum. Finally, we address the issue of manipulating the rules when parameterized by non-decreasing and strictly increasing weight vectors.
منابع مشابه
Iterative Committee Elections for Collective Decision-Making in a Ride-Sharing Application
We investigate the use of voting methods for multiagent decision-making in cooperative traffic applications. We consider a ride-sharing problem in which passengers use committee elections to collectively decide on sets of points of interest to visit. In this paper, we propose an iterative voting protocol for the committee voting rules Minisum Approval and Minimax Approval. Using this protocol, ...
متن کاملManipulation of Hamming-based Approval Voting for Multiple Referenda and Committee Elections
Several methods exist for electing committees of representatives and conducting multiple referenda based on approval voting. Recently, a family of rules for approval-based voting using ordered weighted averaging was proposed in [1], ranging from a simple candidate-wise majority (minisum) to egalitarian rule (minimax). Even though the first rule is strategyproof and the second is not, due to its...
متن کاملSur les aspects computationnels du vote par approbation. (Computational Aspects of Approval Voting)
The subject of this thesis is the study of computational aspects of approval voting. Mostof the works are theoretical results about computational issues raised by approval voting, in manydi erent settings. Indeed, I use algorithmic techniques like polynomial reductions to prove that manyproblems are di cult to solve in the context of approval voting. However, I also study some quest...
متن کاملA Study of Factors that Influenced Voters’ Behaviour: A Case of Billiri Local Government (2019 General Elections)
متن کامل
Approval Voting: Local Search Heuristics and Approximation Algorithms for the Minimax Solution
Voting has been the most general scheme for preference aggregation in multi-agent settings involving agents of diverse preferences. Here, we study a specific type of voting protocols for multi-winner elections, namely approval voting, and we investigate the complexity of computing or approximating the minimax solution in approval voting, concentrating on elections for committees of fixed size. ...
متن کامل